Fault-Tolerant Clock Synchronization in Environments with High Message Delay Variation
نویسندگان
چکیده
| Fault-tolerant clock synchronization is an important requirement in many distributed systems, especially in time-critical and safety-critical applications. Frequently, interactive convergence algorithms are used for fault-tolerant clock synchronization, providing advantages such as fully-distributed operation, low message exchange overhead and simplicity of implementation. This paper presents the measured performance of three interactive convergence , fault-tolerant clock synchronization algorithms. Our experiments were conducted in a distributed UNIX environment featuring high message delay variation, which poses severe constraints on the clock synchronization tightness that may be achieved. The algorithms that were tested in this environment are: FTMA (Fault-Tolerant Midpoint Algorithm) 3], AEFTMA (Adaptive Exponential Averaging Fault-Tolerant Midpoint Algorithm) 4] and SWA (Sliding Window Algorithm) 1], 2]. Our experimental results indicate that SWA outperforms the other algorithms in this environment, being able to achieve tighter synchronization under different simulated fault conditions. The superiority of SWA can be attributed to its high degree of fault tolerance, combined with its ability to treat messages with much longer than expected delays as faults.
منابع مشابه
Fault-tolerant Clock Synchronization for Distributed Systems with High Message Delay Variation
Fault-tolerant clock synchronization is an important requirement in many distributed systems , especially in time-critical and safety-critical applications. Frequently, interactive convergence algorithms are used for fault-tolerant clock synchronization, providing advantages such as fully distributed operation, low message exchange overhead, and simplicity of implementation. This paper presents...
متن کاملSoftware-based Fault-tolerant Clock Synchronization for Distributed Unix Environments Software-based Fault-tolerant Clock Synchronization for Distributed Unix Environments
| Fault-tolerant clock synchronization is often used in distributed systems with requirements such as close interaction between its components, measurements of elapsed time and ordering of events in the system. Diierent implementation approaches can be used to achieve fault-tolerant clock synchronization, depending on criteria such as performance, cost and availability of hardware and operating...
متن کاملFault-Tolerant External Clock Synchronization
We address the problem of how to integrate faulttolerant internal and external clock synchronization. We propose a new algorithm which provides both external and internal clock synchronization for as long as no more than F reference time servers out of a total of 2F+1 are faulty. When the number of faulty reference time servers exceeds F , the algorithm degrades to a fault-tolerant internal clo...
متن کاملA Model for Distributed Computing in Real - Time Systems
This work introduces a fault-tolerant real-time distributed computing model for messagepassing systems, which reconciles the distributed computing and the real-time systems perspective: By just replacing instantaneous computing steps with computing steps of non-zero duration, we obtain a model that both facilitates real-time schedulability analysis and retains compatibility with classic distrib...
متن کاملA Paradigm for Reliable Clock Synchronization*
Existing fault-tolerant clock synchronization protocols are shown to result from refining a single clock synchronization paradigm. In that paradigm, a reliable time source periodically issues messages that cause processors to resynchronize their clocks. The reliable time source is approximated by reading all clocks in the system and using a convergence function to compute a fault-tolerant avera...
متن کامل